منابع مشابه
Fast decreasing and orthogonal polynomials
This paper reviews some aspects of fast decreasing polynomials and some of their recent use in the theory of orthogonal polynomials. 1. Fast decreasing polynomials Fast decreasing, or pin polynomials have been used in various situations. They imitate the ”Dirac delta” best among polynomials of a given degree. They are an indispensable tool to localize results and to create well localized ”parti...
متن کاملFast methods for resumming matrix polynomials and Chebyshev matrix polynomials
Fast and effective algorithms are discussed for resumming matrix polynomials and Chebyshev matrix polynomials. These algorithms lead to a significant speed-up in computer time by reducing the number of matrix multiplications required to roughly twice the square root of the degree of the polynomial. A few numerical tests are presented, showing that evaluation of matrix functions via polynomial e...
متن کاملEquilibrium Problems Associated with Fast Decreasing Polynomials
The determination of the support of the equilibrium measure in the presence of an external field is important in the theory of weighted polynomials on the real line. Here we present a general condition guaranteeing that the support consists of at most two intervals. Applying this to the external fields associated with fast decreasing polynomials, we extend previous results of Totik and Kuijlaar...
متن کاملFast Approximate Implicitization of Envelope Curves using Chebyshev Polynomials
Consider a rational family of planar rational curves in a certain region of interest. We are interested in finding an approximation to the implicit representation of the envelope. Since exact implicitization methods tend to be very costly, we employ an adaptation of approximate implicitization to envelope computation. Moreover, by utilizing an orthogonal basis in the construction process, the c...
متن کاملChebyshev Polynomials and Primality Tests
Algebraic properties of Chebyshev polynomials are presented. The complete factorization of Chebyshev polynomials of the rst kind (Tn(x)) and second kind (Un(x)) over the integers are linked directly to divisors of n and n + 1 respectively. For any odd integer n, it is shown that the polynomial Tn(x)=x is irreducible over the integers i n is prime. The result leads to a generalization of Fermat'...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the London Mathematical Society
سال: 2015
ISSN: 0024-6115
DOI: 10.1112/plms/pdv014